Time Petri Net Unfoldings and Hardware Veriication

نویسندگان

  • Alex Semenov
  • Alex Yakovlev
چکیده

Real-time applications require hardware components to be predictable in terms of their temporal characteristics. For this reason synchronous (clocked) circuits have traditionally been used in real-time systems. With the advent of submicron technologies the role of asynchronous techniques in designing hardware platforms for real-time systems will dramatically increase. Yet the lack of eecient formal techniques and algorithms to validate self-timed system designs for their timing dependability appears to worry most practitioners. This paper describes a novel approach to timing analysis and veriication of asynchronous circuits with bounded delays. The method is based on the time-driven unfolding of a time Petri net model of a circuit. Each reachable state, together with its timing constraints is represented implicitly. It is used to detect potential hazards in asynchronous circuits consisting of micropipeline components and logic gates.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unfoldings of Unbounded Petri Nets

Net unfoldings have attracted much attention as a powerful technique for combating state space explosion in model checking. The method has been applied to veriication of 1-safe ((nite) Petri nets, and more recently also to other classes of nite-state systems such as synchronous products of nite transition systems. We show how unfoldings can be extended to the context of innnite-state systems. M...

متن کامل

Verification Based on Local States

Net unfoldings are a well-known partial order semantics for Petri nets. Here we show that they are well suited to act as models for branching-time logics interpreted on local states. Such local logics (in particular a distributed-calculus) can be used to express properties from the point of view of one component in a distributed system. Local logics often allow for more eecient veriication proc...

متن کامل

Veri cation Based on Local States ?

Net unfoldings are a well-known partial order semantics for Petri nets. Here we show that they are well suited to act as models for branching-time logics interpreted on local states. Such local logics (in particular a distributed-calculus) can be used to express properties from the point of view of one component in a distributed system. Local logics often allow for more eecient veriication proc...

متن کامل

Put your Model Checker on Diet : Veri cation on Local States ?

Net unfoldings are a well-known partial order semantics for Petri nets, very suited to act as models for branching-time logics interpreted on local states. We demonstrate how these local logics (in particular a distributed-calculus) can be used to express properties from the point of view of one component in a distributed system. Thus { in contrast to interleaving branching time logics { in gen...

متن کامل

Linear Programming

Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit such a semantics is to consider ((nite preexes of) net unfoldings | themselves a class of acyclic Petri nets | which contain enough information, albeit implicit, to reason about the reachable markings of the original Pe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998